A Neural Network Model for Equality and Inequality Constrained Minimax Problems
نویسندگان
چکیده
منابع مشابه
A Nonfeasible Quadratic Approximation Recurrent Neural Network for Equality Constrained Optimization Problems
Convex optimization techniques are widely used in the design and analysis of communication systems and signal processing algorithms. In this paper a novel recurrent neural network is presented for solving nonlinear strongly convex equality constrained optimization problems. The proposed neural network is based on recursive quadratic programming for nonlinear optimization, in conjunction with ho...
متن کاملA Neural Network Model to Solve DEA Problems
The paper deals with Data Envelopment Analysis (DEA) and Artificial Neural Network (ANN). We believe that solving for the DEA efficiency measure, simultaneously with neural network model, provides a promising rich approach to optimal solution. In this paper, a new neural network model is used to estimate the inefficiency of DMUs in large datasets.
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملThe Bayes factor for inequality and about equality constrained models
The Bayes factor is a useful tool for evaluating sets of inequality and about equality constrainedmodels. In the approach described, the Bayes factor for a constrained model with the encompassing model reduces to the ratio of two proportions, namely the proportion of, respectively, the encompassing prior and posterior in agreement with the constraints. This enables easy and straightforward esti...
متن کاملA dual neural network for convex quadratic programming subject to linear equality and inequality constraints
A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems. Compared to other recurrent neural networks, the proposed dual network with fewer neurons can solve quadratic programming problems subject to equality, inequality, and bound constraints. The dual neural network is shown to be globally exponentially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2012
ISSN: 1812-5638
DOI: 10.3923/itj.2012.1655.1659